Computing the Principal Branch of log-Gamma
نویسندگان
چکیده
منابع مشابه
Computing the Principal Branch of log-Gamma
The log-Gamma function is an important special function of mathematics, and its principal branch is required in many applications. We develop here the mathematics required to evaluate the principal branch to arbitrary precision, including a new bound for the error in Stirling’s asymptotic series. We conclude with a discussion of the implementation of the principal branch of the log-Gamma functi...
متن کاملThe Multiple Gamma-Functions and the Log-Gamma Integrals
In this paper, which is a companion paper to W , starting from the Euler integral which appears in a generalization of Jensen’s formula, we shall give a closed form for the integral of log Γ 1± t . This enables us to locate the genesis of two new functions A1/a and C1/a considered by Srivastava and Choi. We consider the closely related function A(a) and the Hurwitz zeta function, which render t...
متن کاملFormation interface detection using Gamma Ray log: A novel approach
There are two methods for identifying formation interface in oil wells: core analysis, which is a precise approach but costly and time consuming, and well logs analysis, which petrophysists perform, which is subjective and not completely reliable. In this paper, a novel coupled method was proposed to detect the formation interfaces using GR logs. Second approximation level (a2) of GR log gained...
متن کاملThe Global Gamma Computing
It is believed that writing and debugging parallel programs is far more difficult than writing and debugging sequential programs. Abstract parallel programming models are suggested. Such models include the Gamma formalism, which is based on multiset transformations. In this formalism, programs can be expressed in a very abstract form without any hardware implementation constraints. This makes t...
متن کاملComputing Principal Components Dynamically
In this paper we present closed-form solutions for efficiently updating the prin-cipal components of a set of n points, when m points are added or deleted fromthe point set. For both operations performed on a discrete point set in R, we cancompute the new principal components in O(m) time for fixed d. This is a signifi-cant improvement over the commonly used approach of reco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1997
ISSN: 0196-6774
DOI: 10.1006/jagm.1997.0881